New algorithms for convex cost tension problem with application to computer vision
نویسندگان
چکیده
منابع مشابه
New algorithms for convex cost tension problem with application to computer vision
Motivated by various applications to computer vision, we consider the convex cost tension problem, which is the dual of the convex cost flow problem. In this paper, we first propose a primal algorithm for computing an optimal solution of the problem. Our primal algorithm iteratively updates primal variables by solving associated minimum cut problems. We show that the time complexity of the prim...
متن کاملNew Algorithms for the Dual of the Convex Cost Network Flow Problem with Application to Computer Vision
Motivated by various applications to computer vision, we consider an integer convex optimization problem which is the dual of the convex cost network flow problem. In this paper, we first propose a new primal algorithm for computing an optimal solution of the problem. Our primal algorithm iteratively updates primal variables by solving associated minimum cut problems. The main contribution in t...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولAlgorithms for fields and an application to a problem in computer vision
This thesis is composed of several different parts. We start with an investigation of an important problem in computer vision. An appropriate mathematical modeling of this problem motivates a problem in invariant theory, the examination of the natural action of the group PGLm+1×Sn on the set of n-point configurations (PK) (for some infinite field K and some m,n ∈ N). This in turn leads to an in...
متن کاملFast scaling algorithms for M-convex function minimization with application to the resource allocation problem
M-convex functions, introduced by Murota (1996, 1998), enjoy various desirable properties as “discrete convex functions.” In this paper, we propose two new polynomial-time scaling algorithms for the minimization of an M-convex function. Both algorithms apply a scaling technique to a greedy algorithm for M-convex function minimization, and run as fast as the previous minimization algorithms. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2009
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2009.04.006